Timed Automata May Cause Some Troubles

Patricia Bouyer Timed Automata May Cause Some Troubles

Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it does not support a natural implementation and, in practice, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on fo...

Checking Timed Automata for Some Discretisable Duration Properties Checking Timed Automata for Some Discretisable Duration Properties

The mission of UNU/IIST is to assist developing countries in the application and development of software technology. UNU/IIST contributes through its programmatic activities: 1. advanced development projects in which software techniques supported by tools are applied, 2. research projects in which new techniques for software development are investigated, 3. curriculum development projects in wh...

Timed Automata

Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of real-time systems whose correctness depends on relative magnitudes of different delays. Conseque...

Some Progress in the Symbolic Verification of Timed Automata

Checking Timed Automata for Some Discretisable Duration Properties

In this paper we propose a technique for checking a timed automaton w.r.t a class of discretisable duration properties. It is shown in the paper that if only integral constants are allowed in the time constraints of the timed automata, a linear duration property or an interstate duration property is satissed by a timed automaton if and only if it is satissed by all of the integral behaviours of...